Continuous Yao Graphs

نویسندگان

  • Luis Barba
  • Prosenjit Bose
  • Jean-Lou De Carufel
  • Mirela Damian
  • Rolf Fagerberg
  • André van Renssen
  • Perouz Taslakian
  • Sander Verdonschot
چکیده

In this paper, we introduce a variation of the wellstudied Yao graphs. Given a set of points S ⊂ R and an angle 0 < θ ≤ 2π, we define the continuous Yao graph cY (θ) with vertex set S and angle θ as follows. For each p, q ∈ S, we add an edge from p to q in cY (θ) if there exists a cone with apex p and aperture θ such that q is the closest point to p inside this cone. We study the spanning ratio of cY (θ) for different values of θ. Using a new algebraic technique, we show that cY (θ) is a spanner when θ ≤ 2π/3. We believe that this technique may be of independent interest. We also show that cY (π) is not a spanner, and that cY (θ) may be disconnected for θ > π.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connections between labellings of trees

There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.

متن کامل

Fractal Dimension of Graphs of Typical Continuous Functions on Manifolds

If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of  graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.  

متن کامل

ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS

The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...

متن کامل

Are Yao Graph and Theta Graph Void Free?

Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if the wireless network topologies contain void scenarios (or simply called voids). Since Yao Graph and Theta Graph are two types of geometric graphs exploited to construct wireless network topologies, this paper studies whether these two types of graphs can contain voids. Specifically, th...

متن کامل

Continuous time portfolio optimization

This paper presents dynamic portfolio model based on the Merton's optimal investment-consumption model, which combines dynamic synthetic put option using risk-free and risky assets. This paper is extended version of methodological paper published by Yuan Yao (2012). Because of the long history of the development of foreign financial market, with a variety of financial derivatives, the study on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2014